Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
نویسندگان
چکیده
منابع مشابه
Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
The locally twisted cube is a variation of hypercube, which possesses some properties superior to the hypercube. In this paper, we investigate the edge-faulttolerant hamiltonicity of an n-dimensional locally twisted cube, denoted by LTQn. We show that for any LTQn (n ≥ 3) with at most 2n− 5 faulty edges in which each node is incident to at least two fault-free edges, there exists a fault-free H...
متن کاملCluster Fault-tolerant Routing in Pancake Graphs
In this paper, we propose an O(n) algorithm that finds a fault-free path between any pair of non-faulty nodes in an n-pancake graph with n−2 faulty clusters whose diameters are at most 2. The lengths of the paths obtained by our algorithm are at most d◦(Pn)+7 where d◦(Pn) = b5(n+1)/3c represents the upper bound of the diameter of Pn given by Gates and Papadimitriou. According to the computer ex...
متن کاملFault-tolerant routing in burnt pancake graphs
Recently, researches of parallel distributed computation are getting more important. Especially, massively parallel systems are studied with enthusiasm, and many topologies have been proposed. Since multiple faulty elements are expected in a massively parallel system, fault-tolerant routing is also studied eagerly for communication avoiding the faulty elements [4,6,8]. In this study, we focus o...
متن کاملEdge-bipancyclicity of star graphs under edge-fault tolerant
The star graph Sn is one of the most famous interconnection networks. It has been shown by Li [T.-K. Li, Cycle embedding in star graphs with edge faults, Appl. Math. Comput. 167 (2005) 891–900] that Sn contains a cycle of length from 6 to n! when the number of fault edges in the graph does not exceed n 3. In this paper, we improve this result by showing that for any edge subset F of Sn with jFj...
متن کاملVertex-Fault-Tolerant Hamiltonicity of Cube-Connected Cycles Graphs
The graph CCCn has n × 2 vertices, labeled (l,x), where l is an integer between 0 and n − 1 and x is an n-bit binary string. Two vertices (l,x) and (l′,y) are adjacent if and only if either x = y and |l − l′| = 1, or l = l′ and y = (x). A graph G is called k-vertex-fault-tolerant hamiltonian if it remains hamiltonian after removing at most k vertices. In this paper, we will prove that CCCn is 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.09.015